On the strongly generic undecidability of the Halting Problem
نویسنده
چکیده
منابع مشابه
On the Halting Problem of Finite-State Programs
The undecidability of the halting problem is a well-known research result of theoretical computer science, dating back to Turing’s work in 1936. Nevertheless, it is commonly known that the halting problem on finite-state computer systems is decidable. Thus, any undecidability proof given for the halting problem must imply that it does not apply to finite-state computer systems. The aim of this ...
متن کاملContext-Dependent Functions: Narrowing the Realm of Turing's Halting Problem
This paper describes Turing’s Halting Problem (HP), and reviews the classic proof that no function exists that can solve HP. The concept of a “Context-Dependent Function” (CDF), whose behavior varies based on seemingly irrelevant changes to a program calling that function, is introduced, and the proof of HP’s undecidability is re-examined in light of CDFs. The existence of CDFs is established v...
متن کاملGeneric case completeness
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
متن کاملAutosolvability of halting problem instances for instruction sequences
We position Turing’s result regarding the undecidability of the halting problem as a result about programs rather than machines. The mere requirement that a program of a certain kind must solve the halting problem for all programs of that kind leads to a contradiction in the case of a recent unsolvability result regarding the halting problem for programs. In this paper, we investigate this auto...
متن کاملThe Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
By reduction from the halting problem for Minsky’s two-register machines we prove that there is no algorithm capable of deciding the ∃∀∀∀-theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed such system with undecidable ∃∀∗-theory of one step rewriting (strong undecidability). This improves...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 377 شماره
صفحات -
تاریخ انتشار 2007